Guarding Galleries and Terrains
نویسندگان
چکیده
Let P be a polygon with n vertices. We say that two points of P see each other if the line segment connecting them lies inside (the closure of) P . In this paper we present efficient approximation algorithms for finding the smallest set G of points of P so that each point of P is seen by at least one point of G, and the points of G are constrained to be belong to the set of vertices of an arbitrarily dense grid. We also present similar algorithms for terrains and polygons with holes.
منابع مشابه
Guarding Galleries with No Nooks (extended Abstract)
We consider the problem of guarding galleries that have no small nooks (regions that are visible from only a small fraction of the entire gallery). Intuitively, such galleries (of which convex galleries are a special but uninteresting case) should need fewer guards. We show that in any simply connected gallery in which every corner sees at least a fraction of the other corners there exist a set...
متن کاملVC-Dimension of Visibility on Terrains
A guarding problem can naturally be modeled as a set system (U ,S) in which the universe U of elements is the set of points we need to guard and our collection S of sets contains, for each potential guard g, the set of points from U seen by g. We prove bounds on the maximum VC-dimension of set systems associated with guarding both 1.5D terrains (monotone chains) and 2.5D terrains (polygonal ter...
متن کاملOrthogonal Terrain Guarding is NP-complete
A terrain is an x-monotone polygonal curve, i.e., successive vertices have increasing x-coordinates. Terrain Guarding can be seen as a special case of the famous art gallery problem where one has to place at most k guards on a terrain made of n vertices in order to fully see it. In 2010, King and Krohn showed that Terrain Guarding is NP-complete [SODA ’10, SIAM J. Comput. ’11] thereby solving a...
متن کاملA Fast 2-Approximation Algorithm for Guarding Orthogonal Terrains
Terrain Guarding Problem(TGP), which is known to be NP-complete, asks to find a smallest set of guard locations on a terrain T such that every point on T is visible by a guard. Here, we study this problem on 1.5D orthogonal terrains where the edges are bound to be horizontal or vertical. We propose a 2-approximation algorithm that runs in O(n logm) time, where n and m are the sizes of input and...
متن کاملGuarding Orthogonal Art Galleries with Sliding Cameras
We study the problem of guarding an orthogonal art gallery with security cameras sliding back and forth along straight tracks. We show that if only vertical (alternatively, horizontal) tracks are allowed, then a solution minimizing the number of tracks can be found in polynomial time, and if both orientations are allowed, then a 3-approximation can be found in polynomial time.
متن کامل